#define _CRT_SECURE_NO_WARNINGS 1
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include<math.h>
#include<stdlib.h>
#include<stdio.h>
#include<unordered_map>
#include<queue>
#include<stack>
#include <functional>
#include <memory>
using namespace std;

class Solution {
public:
    int findNumberOfLIS(vector<int>& nums) {
        int n = nums.size();
        vector<int> dp(n, 1), count(n, 1);
        int ret = 1, sum = 1;
        for (int i = 1; i < n; i++)
        {
            for (int j = 0; j < i; j++)
            {
                if (nums[j] < nums[i])
                {
                    if (dp[j] + 1 > dp[i])
                    {
                        dp[i] = dp[j] + 1;
                        count[i] = count[j];
                    }
                    else if (dp[j] + 1 == dp[i]) count[i] += count[j];
                }
            }
            if (ret < dp[i]) ret = dp[i], sum = count[i];
            else if (ret == dp[i]) sum += count[i];
        }
        return sum;
    }
};

int main()
{
	cout << ('z' - 'a' + 1) % 26 << endl;
	cout << ('a' - 'a' + 1) % 26 << endl;
	return 0;
}